An iterative technique for solving equations of statistical equilibrium
نویسنده
چکیده
Superlevel partitioning is combined with a simple relaxation procedure to construct an iterative technique for solving equations of statistical equilibrium. In treating an N -level model atom, the technique avoids the N scaling in computer time for direct solutions with standard linear equation routines and also does not fail at large N due to the accumulation of round-off errors. In consequence, the technique allows detailed model atoms with N > ∼ 10, such as those required for iron peak elements, to be incorporated into diagnostic codes for analysing astronomical spectra. Tests are reported for a 394-level Fe II ion and a 1266-level Ni I–IV atom.
منابع مشابه
Solving systems of nonlinear equations using decomposition technique
A systematic way is presented for the construction of multi-step iterative method with frozen Jacobian. The inclusion of an auxiliary function is discussed. The presented analysis shows that how to incorporate auxiliary function in a way that we can keep the order of convergence and computational cost of Newton multi-step method. The auxiliary function provides us the way to overcome the singul...
متن کاملA new technique for solving Fredholm integro-differential equations using the reproducing kernel method
This paper is concerned with a technique for solving Fredholm integro-dierentialequations in the reproducing kernel Hilbert space. In contrast with the conventionalreproducing kernel method, the Gram-Schmidt process is omitted hereand satisfactory results are obtained. The analytical solution is represented inthe form of series. An iterative method is given to obtain the approximate solution.Th...
متن کاملA new reproducing kernel method for solving Volterra integro-dierential equations
This paper is concerned with a technique for solving Volterra integro-dierential equationsin the reproducing kernel Hilbert space. In contrast with the conventional reproducing kernelmethod, the Gram-Schmidt process is omitted here and satisfactory results are obtained.The analytical solution is represented in the form of series. An iterative method is given toobtain the...
متن کاملAn accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations
In this paper, an accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations is proposed. The convergence analysis of the algorithm is investigated. We show that the proposed algorithm converges to the exact solution for any initial value under certain assumptions. Finally, some numerical examples are given to demons...
متن کاملGauss-Sidel and Successive Over Relaxation Iterative Methods for Solving System of Fuzzy Sylvester Equations
In this paper, we present Gauss-Sidel and successive over relaxation (SOR) iterative methods for finding the approximate solution system of fuzzy Sylvester equations (SFSE), AX + XB = C, where A and B are two m*m crisp matrices, C is an m*m fuzzy matrix and X is an m*m unknown matrix. Finally, the proposed iterative methods are illustrated by solving one example.
متن کامل